Approximation Spaces and Information Granulation

نویسندگان

  • Andrzej Skowron
  • Roman W. Swiniarski
  • Piotr Synak
چکیده

We discuss approximation spaces in the granular computing framework. Such approximation spaces generalise the approaches to concept approximation existing in rough set theory. Approximation spaces are constructed as higher level information granules and are obtained as the result of complex modelling. We present illustrative examples of modelling approximation spaces including approximation spaces for function approximation, inducing concept approximation, and some other information granule approximations. In modelling of such approximation spaces we use an important assumption that not only objects but also more complex information granules involved in approximations are perceived using only partial information about them.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accurate Topological Measures for Rough Sets

Data granulation is considered a good tool of decision making in various types of real life applications. The basic ideas of data granulation have appeared in many fields, such as interval analysis, quantization, rough set theory, Dempster-Shafer theory of belief functions, divide and conquer, cluster analysis, machine learning, databases, information retrieval, and many others. Some new topolo...

متن کامل

A Continuous Information Attribute Reduction Algorithm Based on Hierarchical Granulation

The attribute reduction algorithms based on neighborhood approximation usually use the distance as the approximate metric. Algorithms could result in the loss of information with the same distance threshold to construct the neighborhood families of different dimension spaces. Thereby, an attribute reduction algorithm based on hierarchical granulation is proposed. This algorithm can reduce redun...

متن کامل

Rough Sets and Information Granulation

In this paper, the study of the evolution of approximation space theory and its applications is considered in the context of rough sets introduced by Zdzis law Pawlak and information granulation as well as computing with words formulated by Lotfi Zadeh. Central to this evolution is the rough-mereological approach to approximation of information granules. This approach is built on the inclusion ...

متن کامل

Uncertainty analysis of hierarchical granular structures for multi-granulation typical hesitant fuzzy approximation space

Hierarchical structures and uncertainty measures are two main aspects in granular computing, approximate reasoning and cognitive process. Typical hesitant fuzzy sets, as a prime extension of fuzzy sets, are more flexible to reflect the hesitance and ambiguity in knowledge representation and decision making. In this paper, we mainly investigate the hierarchical structures and uncertainty measure...

متن کامل

A Lattice-Theoretic Approach to Multigranulation Approximation Space

In this paper, we mainly investigate the equivalence between multigranulation approximation space and single-granulation approximation space from the lattice-theoretic viewpoint. It is proved that multigranulation approximation space is equivalent to single-granulation approximation space if and only if the pair of multigranulation rough approximation operators [Formula in text] forms an order-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004